Predicting the clustering properties of galaxy clusters detectable for the Planck satellite

نویسندگان

  • L. Moscardini
  • M. Bartelmann
  • S. Matarrese
  • P. Andreani
چکیده

We study the clustering properties of the galaxy clusters detectable for the Planck satellite due to their thermal Sunyaev-Zel’dovich effect. We take the past light-cone effect and the redshift evolution of both the underlying dark matter correlation function and the cluster bias factor into account. A theoretical mass-temperature relation allows us to convert the sensitivity limit of a catalogue into a minimum mass for the dark matter haloes hosting the clusters. We confirm that the correlation length is an increasing function of the sensitivity limits defining the survey. Using the expected characteristics of the Planck cluster catalogue, which will be a quite large and unbiased sample, we predict the two-point correlation function and power spectrum for different cosmological models. We show that the wide redshift distribution of the Planck survey, will allow to constrain the cluster clustering properties up to z ≈ 1. The dependence of our results on the main cosmological parameters (the matter density parameter, the cosmological constant and the normalisation of the density power-spectrum) is extensively discussed. We find that the future Planck clustering data place only mild constraints on the cosmological parameters, because the results depend on the physical characteristics of the intracluster medium, like the baryon fraction and the mass-temperature relation. Once the cosmological model and the Hubble constant are determined, the clustering data will allow a determination of the baryon fraction with an accuracy of few per cent.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Assessment of Clustering Methods for Predicting Permeability in a Heterogeneous Carbonate Reservoir

Permeability, the ability of rocks to flow hydrocarbons, is directly determined from core. Due to high cost associated with coring, many techniques have been suggested to predict permeability from the easy-to-obtain and frequent properties of reservoirs such as log derived porosity. This study was carried out to put clustering methods (dynamic clustering (DC), ascending hierarchical clustering ...

متن کامل

ar X iv : a st ro - p h / 01 10 64 7 v 1 3 0 O ct 2 00 1 CLUSTER DETECTION FROM SURFACE - BRIGHTNESS FLUCTUATIONS IN SDSS DATA

Galaxy clusters can be detected as surface brightness enhancements in smoothed optical surveys. This method does not require individual galaxies to be identifiable, and enables clusters to be detected out to surprisingly high redshifts, as recently demonstrated by the Las Campanas Distant Cluster Survey (LCDCS). Here, we investigate redshift limits for cluster detection in the Sloan Digital Sky...

متن کامل

Data Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach

Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...

متن کامل

اندازه‌گیری نمایه عمق نوری خوشه‌های کهکشانی با استفاده از اثرسونیائف زلدوویچ جنبشی

baryonic matter distribution in the large-scale structures is one of the main questions in cosmology. This distribution can provide valuable information regarding  the processes of galaxy formation and evolution. On the other hand, the missing baryon problem is still under debate. One of the most important cosmological structures for studying the rate and  the distribution of the baryons is gal...

متن کامل

Data Clustring Using A New CGA(Chaotic-Generic Algorithm) Approach

Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001